Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
نویسندگان
چکیده
منابع مشابه
Inexact subgradient methods for quasi-convex optimization problems
In this paper, we consider a generic inexact subgradient algorithm to solve a nondifferentiable quasi-convex constrained optimization problem. The inexactness stems from computation errors and noise, which come from practical considerations and applications. Assuming that the computational errors and noise are deterministic and bounded, we study the effect of the inexactness on the subgradient ...
متن کاملOn proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
In this paper we present a variant of the proximal forward-backward splitting method for solving nonsmooth optimization problems in Hilbert spaces, when the objective function is the sum of two nondifferentiable convex functions. The proposed iteration, which will be call the Proximal Subgradient Splitting Method, extends the classical projected subgradient iteration for important classes of pr...
متن کاملQuasi-convex Functions and Quasi-monotone Operators
The notions of a quasi-monotone operator and of a cyclically quasi-monotone operator are introduced, and relations between such operators and quasi-convex functions are established.
متن کاملProximal Quasi-Newton Methods for Convex Optimization
In [19], a general, inexact, e cient proximal quasi-Newton algorithm for composite optimization problems has been proposed and a sublinear global convergence rate has been established. In this paper, we analyze the convergence properties of this method, both in the exact and inexact setting, in the case when the objective function is strongly convex. We also investigate a practical variant of t...
متن کاملQuasi-orthogonal expansions for functions in BMO
For {φ_n(x)}, x ε [0,1] an orthonormalsystem of uniformly bounded functions, ||φ_n||_{∞}≤ M
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2019
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-019-00818-6